Efficient characteristic refinements for finite groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE CHARACTERISTIC DEGREE OF FINITE GROUPS

In this article we introduce and study the concept of characteristic degree of a subgroup in a finite group. We define the characteristic degree of a subgroup H in a finite group G as the ratio of the number of all pairs (h,α) ∈ H×Aut(G) such that h^α∈H, by the order of H × Aut(G), where Aut(G) is the automorphisms group of G. This quantity measures the probability that H can be characteristic ...

متن کامل

New refinements of the McKay conjecture for arbitrary finite groups

Let G be an arbitrary finite group and fix a prime number p. The McKay conjecture asserts that G and the normalizer in G of a Sylow p-subgroup have equal numbers of irreducible characters with degrees not divisible by p. The Alperin-McKay conjecture is version of this as applied to individual Brauer p-blocks of G. We offer evidence that perhaps much stronger forms of both of these conjectures a...

متن کامل

Characteristic Subgroups of Finite Abelian Groups

We consider the question: When do two finite abelian groups have isomorphic lattices of characteristic subgroups? An explicit description of the characteristic subgroups of such groups enables us to give a complete answer to this question in the case where at least one of the groups has odd order. An “exceptional” isomorphism, which occurs between the lattice of characteristic subgroups of Zp ×...

متن کامل

Lusztig’s conjecture for finite classical groups with even characteristic

The determination of scalars involved in Lusztig’s conjecture concerning the characters of finite reductive groups was achieved by Waldspurger in the case of finite classical groups Sp2n(Fq) or On(Fq) when p, q are large enough. Here p is the characteristic of the finite field Fq . In this paper, we determine the scalars in the case of Sp2n(Fq) with p = 2, by applying the theory of symmetric sp...

متن کامل

Efficient multiplication algorithms for finite polycyclic groups

Let G be a finite soluble group given by a reduced confluent polycyclic presentation. Represent group elements by reduced words. Then there exists an algorithm for multiplying two group elements which has subexponential running time and requires polynomial space. Moreover, given the prime factorisation of the group order, the problem of multiplying two group elements is probabilistically polyno...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2017

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2016.07.007